THE NP-COMPLETENESS OF THE HAMILTONIAN CYCLE PROBLEM IN PLANAR DIGRAPHS WITH DEGREE BOUND TOPLESNIK J.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 199-201; BIBL. 7 REF.Article

CONNECTIVITY OF REGULAR GRAPHS AND THE EXISTENCE OF 1-FACTORSPLESNIK J.1972; MAT. CAS.; CESKOSL.; DA. 1972; VOL. 22; NO 4; PP. 310-318; BIBL. 6 REF.Serial Issue

A BOUND FOR THE STEINER TREE PROBLEM IN GRAPHSPLESNIK J.1981; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1981; VOL. 31; NO 2; PP. 155-163; ABS. RUS; BIBL. 20 REF.Article

TWO CONSTRUCTIONS OF GEODETIC GRAPHS.PLESNIK J.1977; MATH. SLOV.; TCHECOSL.; DA. 1977; VOL. 27; NO 1; PP. 65-71; ABS. RUSSE; BIBL. 11 REF.Article

GRAPHS WITH A HOMOGENEITY.PLESNIK J.1975; GLASN. MAT.; JUGOSL.; DA. 1975; VOL. 10; NO 1; PP. 9-23; ABS. SERBO-CROATE; BIBL. 11 REF.Article

COMPLEXITY OF DECOMPOSING GRAPHS INTO FACTORS WITH GIVEN DIAMETERS OF RADIIPLESNIK J.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 4; PP. 379-387; BIBL. 32 REF.Article

ONE METHOD FOR PROVING THE IMPOSSIBILITY OF CERTAIN MOORE GRAPHS.PLESNIK J.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 4; PP. 363-376; BIBL. 16 REF.Article

THE COMPLEXITY OF DESIGNING A NETWORK WITH MINIMUM DIAMETERPLESNIK J.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 77-85; BIBL. 8 REF.Article

ON THE COMPUTATIONAL COMPLEXITY ON CENTERS LOCATING IN A GRAPHPLESNIK J.1980; APL. MAT.; ISSN 0373-6725; CSK; DA. 1980; VOL. 25; NO 6; PP. 445-452; ABS. SLO/RUS; BIBL. 16 REF.Article

REMARK ON MATCHINGS IN REGULAR GRAPHSPLESNIK J.1979; ACTA FAC. RERUM NAT. UNIV. COMENIANAE, MATH.; CSK; DA. 1979; VOL. 34; PP. 63-67; ABS. RUS; BIBL. 5 REF.Article

A heuristic for the p-center problem in graphsPLESNIK, J.Discrete applied mathematics. 1987, Vol 17, Num 3, pp 263-268, issn 0166-218XArticle

ETUDE DE L'EFFET DES DOUBLES ET TRIPLES CROISEMENTS DANS L'ELEVAGE DES BOVINS SUR LEUR CROISSANCE ET LEUR PRODUCTION DE LAIT. I. CROISSANCE DU POIDS VIF ET DE LA TAILLE DU CORPS CHEZ DES VEAUX DI ET TRIHYBRIDESCHRENEK J; PLESNIK J.1976; SCI. WORKS RES. INST. PRODUCT. NITRA; CZECHOSL.; DA. 1976; VOL. 13; PP. 65-78; ABS. ANGL. RUSSE; BIBL. 7 REF.Article

COLORING OF GRAPHS BY PARTITIONINGPLESNIK J.1980; MATH. SLOV.; CSK; DA. 1980; VOL. 30; NO 2; PP. 121-127; ABS. RUS; BIBL. 22 REF.Article

A CONSTRUCTION OF GEODETIC BLOCKSPLESNIK J.1980; ACTA FAC. SERUM NAT. UNIV. COMEN., MATH.; ISSN 0373-8183; CSK; DA. 1980; NO 36; PP. 47-60; ABS. SLO/RUS; BIBL. 8 REF.Article

MINIMUM BLOCK CONTAINING A GIVEN GRAPH.PLESNIK J.1976; ARCH. MATH.; DTSCH.; DA. 1976; VOL. 27; NO 6; PP. 668-672; BIBL. 6 REF.Article

CRITICAL GRAPHS OF GIVEN DIAMETER.PLESNIK J.1975; ACTA FAC. RERUM NAT. UNIV. COMENIANAE, MATH.; TCHECOSL.; DA. 1975; VOL. 30; PP. 71-93; ABS. SLOVAQUE RUSSE; BIBL. 14 REF.Article

REMARKS ON REGULAR FACTORS OF REGULAR GRAPHS.PLESNIK J.1974; CZECHOSL. MATH. J.; CZECHOSL.; DA. 1974; VOL. 24; NO 2; PP. 292-300; BIBL. 12 REF.Article

INFLUENCE DE LA RACE PIE NOIR DE PLAINE SUR LA COMPOSITION DE LA DEMI-CARCASSE DE JEUNES TAURILLONS A L'ENGRAISCHRENEK J; PLESNIK J.1976; POLNOHOSPODARSTVO; CESKOSL.; DA. 1976; VOL. 22; NO 1; PP. 66-72; ABS. ANGL. RUSSE; BIBL. 10 REF.Article

A note on the complexity of finding regular subgraphsPLESNIK, J.Discrete mathematics. 1984, Vol 49, Num 2, pp 161-167, issn 0012-365XArticle

ON THE COMPLEXITY OF FINDING DEGREE CONSTRAINED SUBGRAPHSPLESNIK J; WAWRUCH A.1982; ACTA MATH. UNIV. COMEN.; ISSN 0231-6986; CSK; DA. 1982; VOL. 40-41; PP. 215-218; ABS. SLO/RUS; BIBL. 9 REF.Article

On the sum of all distances in a graph or digraphPLESNIK, J.Journal of graph theory. 1984, Vol 8, Num 1, pp 1-21, issn 0364-9024Article

A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphsPLESNIK, J.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 3, pp 284-297, issn 0095-8956Article

RECHERCHE SUR L'APPLICATION DE LA CONSANGUINITE ET DE SES EFFETS SUR L'AMELIORATION DES BOVINSBELLER I; PLESNIK J.1976; SCI. WORKS RES. INST. PRODUCT. NITRA; CZECHOSL.; DA. 1976; VOL. 13; PP. 127-133; ABS. ANGL. RUSSE; BIBL. 10 REF.Article

STRONGLY GEODETIC DIRECTED GRAPHS.PLESNIK J; ZNAM S.1974; ACTA FAC. RERUM NAT. UNIV. COMENIANAE, MATH.; TCHECOSL.; DA. 1974; NO 29; PP. 29-34; BIBL. 3 REF.Article

Constrained weighted matchings and edge coverings in graphsPLESNIK, J.Discrete applied mathematics. 1999, Vol 92, Num 2-3, pp 229-241, issn 0166-218XArticle